Endomorphisms of linear automata
نویسندگان
چکیده
منابع مشابه
Automata Computation of Branching Laws for Endomorphisms of Cuntz Algebras
In our previous articles, we have presented a class of endomorphisms of the Cuntz algebras which are defined by polynomials of canonical generators and their conjugates. We showed the classification of some case under unitary equivalence by help of branching laws of permutative representations. In this article, we construct an automaton which is called the Mealy machine associated with the endo...
متن کاملDensity of orbits of endomorphisms of commutative linear algebraic groups
We prove a conjecture of Medvedev and Scanlon for endomorphisms of connected commutative linear algebraic groups G defined over an algebraically closed field k of characteristic 0. That is, if Φ: G −→ G is a dominant endomorphism, we prove that one of the following holds: either there exists a non-constant rational function f ∈ k(G) preserved by Φ (i.e., f ◦ Φ = f), or there exists a point x ∈ ...
متن کاملTree Automata and Automata on Linear Orderings
We show that the inclusion problem is decidable for rational languages of words indexed by scattered countable linear orderings. The method leans on a reduction to the decidability of the monadic second order theory of the infinite binary tree [9]. Mathematics Subject Classification. 68Q45, 03D05.
متن کاملLinear Cellular Automata and Fischer Automata
We study the sizes of minimal finite state machines associated with linear cellular automata. In particular, we construct a class of binary linear cellular automata whose corresponding minimal automata exhibit full exponential blow-up. These cellular automata have Hamming distance 1 to a permutation automaton. Moreover, the corresponding minimal Fischer automata as well as the minimal DFAs have...
متن کاملLinear Cellular Automata and Finite Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1978
ISSN: 0022-0000
DOI: 10.1016/0022-0000(78)90037-5